'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  fst(0(), Z) -> nil()
     , fst(s(), cons(Y)) -> cons(Y)
     , from(X) -> cons(X)
     , add(0(), X) -> X
     , add(s(), Y) -> s()
     , len(nil()) -> 0()
     , len(cons(X)) -> s()}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  fst^#(0(), Z) -> c_0()
    , fst^#(s(), cons(Y)) -> c_1()
    , from^#(X) -> c_2()
    , add^#(0(), X) -> c_3()
    , add^#(s(), Y) -> c_4()
    , len^#(nil()) -> c_5()
    , len^#(cons(X)) -> c_6()}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.